Internal Categoricity, Truth and Determinacy
نویسندگان
چکیده
Abstract This paper focuses on the categoricity of arithmetic and determinacy arithmetical truth. Several ‘internal’ results have been discussed in recent literature. Against background philosophical position called internalism , we propose investigate truth-theoretic versions internal based a primitive truth predicate. We argue for compatibility predicate with provide novel argument (and proof of) version some positive properties.
منابع مشابه
Determinacy and determinacy analysis
One attractive, unique feature of logic programming languages is their ability to succinctly and declaratively express search. The alternatives of a search can be speci ed by a set of clauses de ning the same predicate. By backtracking, considering in turn each of these clauses, the di erent alternatives are explored until a solution (if it exists) is found. However, though backtracking is esse...
متن کامل1 Truth In Internal Realism
This essay deals with the concept of truth in the context of a version of internal realism. In §1 I define some variants of realism using a set of realistic axioms. In §2 I will argue that for semantical reasons we should be realists of some kind. In §3 I plead for an internalistic setting of realism starting from the thesis that truth is, at least, not a non-epistemic concept. We have to bear ...
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملCategoricity and Scott Families
Effective model theory is an area of logic that analyzes the effective content of the typical notions and results of model theory and universal algebra. Typical notions in model theory and universal algebra are languages and structures, theories and models, models and their submodels, automorphisms and isomorphisms, embeddings and elementary embeddings. In this paper languages, structures, and ...
متن کاملDeterminacy and ∆
Let D = {d n } be a countable collection of ∆ 1 3 degrees. Assuming that all co-analytic games on integers are determined (or equivalently that all reals have " sharps "), we prove that either D has a ∆ 1 3-minimal upper bound, or that for any n, and for every real r recursive in d n , games in the pointclasses ∆ 1 2 (r) are determined. This is proven using Core Model theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Philosophical Logic
سال: 2023
ISSN: ['1573-0433', '0022-3611']
DOI: https://doi.org/10.1007/s10992-023-09707-6